Translating the Cantor Set by a Random Real

نویسندگان

  • RANDALL DOUGHERTY
  • JASON TEUTSCH
چکیده

We determine the constructive dimension of points in random translates of the Cantor set. The Cantor set “cancels randomness” in the sense that some of its members, when added to Martin-Löf random reals, identify a point with lower constructive dimension than the random itself. In particular, we find the Hausdorff dimension of the set of points in a Cantor set translate with a given constructive dimension. 1. Fractals and random reals We explore an essential interaction between algorithmic randomness, classical fractal geometry, and additive number theory. In this paper, we consider the dimension of the intersection of a given set with a translate of another given set. We shall concern ourselves not only with classical Hausdorff measures and dimension but also the effective analogs of these concepts. More specifically, let C denote the standard middle third Cantor set [7, 18], and for each number α let (1.1) E=α = {x : cdimH{x} = α} consist of all real numbers with constructive dimension α. We answer a question posed to us by Doug Hardin by proving the following theorem: Theorem 1.1. If 1− log 2/ log 3 ≤ α ≤ 1 and r is a Martin-Löf random real, then the Hausdorff dimension of (1.2) (C + r) ∩ E=α is α−(1− log 2/ log 3). Moreover the Hausdorff measure of this set in its dimension is positive. From this result we obtain a simple relation between the effective and classical Hausdorff dimensions of (1.2); the difference is exactly 1 minus the dimension of the Cantor set. We conclude that many points in the Cantor set additively cancel randomness. We discuss some of the notions involved in this paper. Intuitively, a real is “random” if it does not inherit any special properties by belonging to an effective null class. We say a number is Martin-Löf random [3, 13] if it “passes” all MartinLöf tests. A Martin-Löf test is a uniformly computably enumerable (c.e.) sequence 2000 Mathematics Subject Classification. Primary 68Q30; Secondary 11K55, 28A78.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Translating the Cantor set by a random

We determine the constructive dimension of points in random translates of the Cantor set. The Cantor set “cancels randomness” in the sense that some of its members, when added to Martin-Löf random reals, identify a point with lower constructive dimension than the random itself. In particular, we find the Hausdorff dimension of the set of points in a Cantor set translate with a given constructiv...

متن کامل

How Large is the Set of Disjunctive Sequences?

We consider disjunctive sequences, that is, infinite sequences (ω-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described in an easy way using recursive languages and, besides being a set of measure one, is a residual set in Cantor space. Moreover, we consider the subword complexity of sequences: here disjunctive sequences are shown to b...

متن کامل

Metric Diophantine approximation on the middle-third Cantor set

Let μ ≥ 2 be a real number and let M(μ) denote the set of real numbers approximable at order at least μ by rational numbers. More than eighty years ago, Jarńık and, independently, Besicovitch established that the Hausdorff dimension of M(μ) is equal to 2/μ. We investigate the size of the intersection ofM(μ) with Ahlfors regular compact subsets of the interval [0, 1]. In particular, we propose a...

متن کامل

π11-Martin-Löf random reals as measures of natural open sets

We elaborate a recursive-theoretic method to define real numbers which are random to any jump of the halting problem. This is obtained by generalizing a result of V. Becher and G. Chaitin dealing with the class of cofinite sets. As in the work of V. Becher and S. Grigorieff (but this time in the context of open sets in Cantor space) appeal to completeness phenomena replaces machine arguments. M...

متن کامل

Completeness in Probabilistic Metric Spaces

The idea of probabilistic metric space was introduced by Menger and he showed that probabilistic metric spaces are generalizations of metric spaces. Thus, in this paper, we prove some of the important features and theorems and conclusions that are found in metric spaces. At the beginning of this paper, the distance distribution functions are proposed. These functions are essential in defining p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012